Identifying malicious web infrastructures

ABSTRACT

Identifying malicious servers is provided. Malicious edges between server vertices corresponding to visible servers and invisible servers involved in network traffic redirection chains are determined based on determined graph-based features within a bipartite graph corresponding to invisible server vertices involved in the network traffic redirection chains and determined distance-based features corresponding to the invisible server vertices involved in the network traffic redirection chains. Malicious server vertices are identified in the bipartite graph based on the determined malicious edges between the server vertices corresponding to the visible servers and invisible servers involved in the network traffic redirection chains. Access by client devices is blocked to malicious servers corresponding to the identified malicious server vertices in the bipartite graph.

BACKGROUND

1. Field

The disclosure relates generally to computer network security and morespecifically to identifying malicious servers within malicious Webinfrastructures based on visibility of network servers and topology ofnetwork traffic redirection chains of network servers.

2. Description of the Related Art

Malicious Web activities are a major threat to the safety of online Webusers and their computers. These malicious Web activities areorchestrated through malicious Web infrastructures, which enable cybercriminals to conduct their criminal activities on the Web and utilizeother cyber criminals' resources within the malicious Webinfrastructures. Such malicious Web infrastructures are the backbone ofthese criminal activities in today's cyberspace, delivering maliciouscontent, such as malicious software, globally and causing hundreds ofmillions of dollars in damage every year. Malicious software, or malwarefor short, is any software used to disrupt computer operations, gathersensitive information stored on computers, or gain access to privatecomputer systems and networks, for example. Malware is an umbrella termreferring to a variety of hostile or intrusive software, such as, forexample, computer viruses, worms, Trojan horses, ransomware, spyware,adware, scareware, and other malicious programs.

SUMMARY

According to one illustrative embodiment, a computer-implemented methodfor identifying malicious servers is provided. A computer determinesmalicious edges between server vertices corresponding to visible serversand invisible servers involved in network traffic redirection chainsbased on determined graph-based features within a bipartite graphcorresponding to invisible server vertices involved in the networktraffic redirection chains and determined distance-based featurescorresponding to the invisible server vertices involved in the networktraffic redirection chains. The computer identifies malicious serververtices in the bipartite graph based on the determined malicious edgesbetween the server vertices corresponding to the visible servers andinvisible servers involved in the network traffic redirection chains.The computer blocks access by client devices to malicious serverscorresponding to the identified malicious server vertices in thebipartite graph. According to other illustrative embodiments, a computersystem and a computer program product for identifying malicious serversare provided.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a pictorial representation of a network of data processingsystems in which illustrative embodiments may be implemented;

FIG. 2 is a diagram of a data processing system in which illustrativeembodiments may be implemented;

FIG. 3 is a diagram of an example of components of a malicious Webinfrastructure detection application in accordance with an illustrativeembodiment;

FIG. 4 is a diagram of an example of a bipartite graph in accordancewith an illustrative embodiment;

FIG. 5 is a specific example of machine learning classifier input inaccordance with an illustrative embodiment;

FIG. 6 is a diagram of an example of a propagation graph generationprocess in accordance with an illustrative embodiment;

FIG. 7 is a flowchart illustrating a process for identifying serverswithin a network as either a visible server or an invisible server inaccordance with an illustrative embodiment;

FIGS. 8A and 8B are a flowchart illustrating a process for identifyingmalicious servers within a network in accordance with an illustrativeembodiment; and

FIG. 9 is a flowchart illustrating a process for propagating maliciousand visibility scores of identified malicious servers to neighboringinvisible servers to identify additional malicious servers based ontheir correlation to the identified malicious servers in accordance withan illustrative embodiment.

DETAILED DESCRIPTION

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer program instructions may be provided to a processor of ageneral purpose computer, special purpose computer, or otherprogrammable data processing apparatus to produce a machine, such thatthe instructions, which execute via the processor of the computer orother programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer program instructions may also bestored in a computer readable medium that can direct a computer, otherprogrammable data processing apparatus, or other devices to function ina particular manner, such that the instructions stored in the computerreadable medium produce an article of manufacture including instructionswhich implement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

With reference now to the figures, and in particular, with reference toFIGS. 1 and 2, diagrams of data processing environments are provided inwhich illustrative embodiments may be implemented. It should beappreciated that FIGS. 1 and 2 are only meant as examples and are notintended to assert or imply any limitation with regard to theenvironments in which different embodiments may be implemented. Manymodifications to the depicted environments may be made.

FIG. 1 depicts a pictorial representation of a network of dataprocessing systems in which illustrative embodiments may be implemented.Network data processing system 100 is a network of computers and otherdevices in which the illustrative embodiments may be implemented.Network data processing system 100 contains network 102, which is themedium used to provide communications links between the computers andthe other devices connected together within network data processingsystem 100. Network 102 may include connections, such as, for example,wire communication links, wireless communication links, and fiber opticcables.

In the depicted example, server 104 and server 106 connect to network102, along with storage 108. Server 104 and server 106 may be, forexample, server computers with high-speed connections to network 102. Inaddition, server 104 may provide a set of one or more services to clientdevices connected to network 102. For example, server 104 may provide amalicious Web infrastructure detection service to registered clientdevices. A malicious Web infrastructure detection service is a processthat identifies malicious servers within malicious Web infrastructuresbased on visibility of the network servers and the topology of networktraffic redirection chains created by the network servers. The maliciousWeb servers attempt to deliver malicious content, such as malware, tocomputers and other data processing system devices, such as smartphones, connected to the malicious Web infrastructure.

Client device 110, client device 112, and client device 114 also connectto network 102. Client devices 110, 112, and 114 are registered clientsto server 104. In the depicted example, server 104 may provideinformation, such as boot files, operating system images, and softwareapplications to client devices 110, 112, and 114.

In this example, client devices 110, 112, and 114 are computers, such asdesktop computers or network computers with wire or wirelesscommunication links to network 102. However, it should be noted thatclient devices 110, 112, and 114 are intended as examples only. In otherwords, client devices 110, 112, and 114 also may include laptopcomputers, tablet computers, handheld computers, smart phones, andpersonal digital assistants, for example.

Storage 108 is a network storage device capable of storing data in astructured format or unstructured format. Storage 108 may providestorage of a plurality of different client device user names andassociated identification numbers; user profiles; and user accountinformation associated with the malicious Web infrastructure detectionservice. Storage 108 also may store malicious Web infrastructuredetection software applications, server domain name white lists, searchengines, server domain name search results, visible server lists,invisible server lists, bipartite graphs of visible and invisibleservers, machine learning classifiers, server network trafficpropagation chain graphs, clustering programs, malicious server lists,compromised servers lists, and the like. Further, storage unit 108 maystore other data, such as authentication or credential data that mayinclude user names, passwords, and biometric data associated with theplurality of users and system administrators. It should be noted thatstorage unit 108 may store any data that may be utilized by themalicious Web infrastructure detection service.

In addition, it should be noted that network data processing system 100may include any number of additional server devices, client devices, andother devices not shown. Program code located in network data processingsystem 100 may be stored on a computer readable storage medium anddownloaded to a computer or other data processing device for use. Forexample, program code may be stored on a computer readable storagemedium on server 104 and downloaded to client device 110 over network102 for use on client device 110.

In the depicted example, network data processing system 100 may beimplemented as a number of different types of communication networks,such as, for example, an internet, an intranet, a local area network(LAN), and a wide area network (WAN). FIG. 1 is intended as an example,and not as an architectural limitation for the different illustrativeembodiments.

With reference now to FIG. 2, a diagram of a data processing system isdepicted in accordance with an illustrative embodiment. Data processingsystem 200 is an example of a computer, such as server 104 in FIG. 1, inwhich computer readable program code or instructions implementingprocesses of illustrative embodiments may be located. In thisillustrative example, data processing system 200 includes communicationsfabric 202, which provides communications between processor unit 204,memory 206, persistent storage 208, communications unit 210,input/output (I/O) unit 212, and display 214.

Processor unit 204 serves to execute instructions for softwareapplications and programs that may be loaded into memory 206. Processorunit 204 may be a set of one or more hardware processor devices or maybe a multi-processor core, depending on the particular implementation.Further, processor unit 204 may be implemented using one or moreheterogeneous processor systems, in which a main processor is presentwith secondary processors on a single chip. As another illustrativeexample, processor unit 204 may be a symmetric multi-processor systemcontaining multiple processors of the same type.

Memory 206 and persistent storage 208 are examples of storage devices216. A computer readable storage device is any piece of hardware that iscapable of storing information, such as, for example, withoutlimitation, data, computer readable program code in functional form,and/or other suitable information either on a transient basis and/or apersistent basis. Further, a computer readable storage device excludes apropagation medium. Memory 206, in these examples, may be, for example,a random access memory, or any other suitable volatile or non-volatilestorage device. Persistent storage 208 may take various forms, dependingon the particular implementation. For example, persistent storage 208may contain one or more devices. For example, persistent storage 208 maybe a hard drive, a flash memory, a rewritable optical disk, a rewritablemagnetic tape, or some combination of the above. The media used bypersistent storage 208 may be removable. For example, a removable harddrive may be used for persistent storage 208.

In this example, persistent storage 208 stores malicious Webinfrastructure detection application 218. Malicious Web infrastructuredetection application 218 is a software program that provides theservice of identifying malicious servers in one or more malicious Webinfrastructures located within a network of a plurality of servers basedon visibility of each of the plurality of servers and the topology ofnetwork traffic redirection chains created by one or more of theplurality of servers. After identifying which servers within the networkare malicious servers, malicious Web infrastructure detectionapplication 218 may automatically take action, such as, for example,block access to those identified malicious servers and notify networksecurity personnel or system administrators to determine whether furtheraction is required, such as notifying appropriate authorities of cybercriminal activity.

Communications unit 210, in this example, provides for communicationwith other computers, data processing systems, and devices via anetwork, such as network 102 in FIG. 1. Communications unit 210 mayprovide communications through the use of both physical and wirelesscommunications links. The physical communications link may utilize, forexample, a wire, cable, universal serial bus, or any other physicaltechnology to establish a physical communications link for dataprocessing system 200. The wireless communications link may utilize, forexample, shortwave, high frequency, ultra high frequency, microwave,wireless fidelity (Wi-Fi), bluetooth technology, global system formobile communications (GSM), code division multiple access (CDMA),second-generation (2G), third-generation (3G), fourth-generation (4G),4G Long Term Evolution (LTE), LTE Advanced, or any other wirelesscommunication technology or standard to establish a wirelesscommunications link for data processing system 200.

Input/output unit 212 allows for the input and output of data with otherdevices that may be connected to data processing system 200. Forexample, input/output unit 212 may provide a connection for user inputthrough a keypad, a keyboard, a mouse, and/or some other suitable inputdevice. Display 214 provides a mechanism to display information to auser and may include touch screen capabilities to allow the user to makeon-screen selections through user interfaces or input data, for example.

Instructions for the operating system, applications, and/or programs maybe located in storage devices 216, which are in communication withprocessor unit 204 through communications fabric 202. In thisillustrative example, the instructions are in a functional form onpersistent storage 208. These instructions may be loaded into memory 206for running by processor unit 204. The processes of the differentembodiments may be performed by processor unit 204 using computerimplemented instructions, which may be located in a memory, such asmemory 206. These instructions are referred to as program code, computerusable program code, or computer readable program code that may be readand run by a processor in processor unit 204. The program code, in thedifferent embodiments, may be embodied on different physical computerreadable storage devices, such as memory 206 or persistent storage 208.

Program code 220 is located in a functional form on computer readablemedia 222 that is selectively removable and may be loaded onto ortransferred to data processing system 200 for running by processor unit204. Program code 220 and computer readable media 222 form computerprogram product 224. In one example, computer readable media 222 may becomputer readable storage media 226 or computer readable signal media228. Computer readable storage media 226 may include, for example, anoptical or magnetic disc that is inserted or placed into a drive orother device that is part of persistent storage 208 for transfer onto astorage device, such as a hard drive, that is part of persistent storage208. Computer readable storage media 226 also may take the form of apersistent storage, such as a hard drive, a thumb drive, or a flashmemory that is connected to data processing system 200. In someinstances, computer readable storage media 226 may not be removable fromdata processing system 200.

Alternatively, program code 220 may be transferred to data processingsystem 200 using computer readable signal media 228. Computer readablesignal media 228 may be, for example, a propagated data signalcontaining program code 220. For example, computer readable signal media228 may be an electro-magnetic signal, an optical signal, and/or anyother suitable type of signal. These signals may be transmitted overcommunication links, such as wireless communication links, an opticalfiber cable, a coaxial cable, a wire, and/or any other suitable type ofcommunications link. In other words, the communications link and/or theconnection may be physical or wireless in the illustrative examples. Thecomputer readable media also may take the form of non-tangible media,such as communication links or wireless transmissions containing theprogram code.

In some illustrative embodiments, program code 220 may be downloadedover a network to persistent storage 208 from another device or dataprocessing system through computer readable signal media 228 for usewithin data processing system 200. For instance, program code stored ina computer readable storage media in a data processing system may bedownloaded over a network from the data processing system to dataprocessing system 200. The data processing system providing program code220 may be a server computer, a client computer, or some other devicecapable of storing and transmitting program code 220.

The different components illustrated for data processing system 200 arenot meant to provide architectural limitations to the manner in whichdifferent embodiments may be implemented. The different illustrativeembodiments may be implemented in a data processing system includingcomponents in addition to, or in place of, those illustrated for dataprocessing system 200. Other components shown in FIG. 2 can be variedfrom the illustrative examples shown. The different embodiments may beimplemented using any hardware device or system capable of executingprogram code. As one example, data processing system 200 may includeorganic components integrated with inorganic components and/or may becomprised entirely of organic components excluding a human being. Forexample, a storage device may be comprised of an organic semiconductor.

As another example, a computer readable storage device in dataprocessing system 200 is any hardware apparatus that may store data.Memory 206, persistent storage 208, and computer readable storage media226 are examples of physical storage devices in a tangible form.

In another example, a bus system may be used to implement communicationsfabric 202 and may be comprised of one or more buses, such as a systembus or an input/output bus. Of course, the bus system may be implementedusing any suitable type of architecture that provides for a transfer ofdata between different components or devices attached to the bus system.Additionally, a communications unit may include one or more devices usedto transmit and receive data, such as a modem or a network adapter.Further, a memory may be, for example, memory 206 or a cache such asfound in an interface and memory controller hub that may be present incommunications fabric 202.

In the course of developing illustrative embodiments, it was discoveredthat cyber criminals utilize malicious web infrastructures toindustrialize their criminal activities via server network trafficredirection and to share resources with other cyber criminals withintheir malicious web infrastructures. Malicious web infrastructures havebecome one of the major vehicles for cyber criminals to deliver theirmalicious Web content, such as, for example, phishing Web pages, exploitkits that deliver a malicious payload to a victim's computer to stealinformation and exploit computer vulnerabilities, and other types ofmalware on a global scale. To avoid detection, these cyber criminalsoften exploit compromised benign Web servers as stepping stones toredirect network traffic of visitors of those compromised benign Webservers, potentially through multiple hops, to malicious servers thathost the malicious Web content. Moreover, these cyber criminals alsoexploit a variety of other methods to hide their malicious servers fromdetection by, for example, domain name generation and fast fluxing. Fastfluxing is a Domain Name System technique used to hide phishing andmalware delivery sites behind an ever-changing network of compromisedservers acting as proxies. The basic idea behind fast fluxing is to havenumerous Internet Protocol (IP) addresses associated with a singleregistered domain name, where the IP addresses are swapped in and outwith high frequency, through changing Domain Name System records.Therefore, it is critical to identify the persistent features andproperties of these malicious web infrastructures to defend against suchdynamic constructs.

Existing solutions study these malicious Web infrastructures byanalyzing how the malicious campaigns operate at each attack channel,such as, for example, scamming hosting infrastructures and maliciousadvertising networks. For example, existing solutions study the topologyof malicious Web infrastructures. These existing solutions are limitedby requiring an initial set of identified malicious servers to seed thepropagation onto a server topology graph to find more malicious servers.

In terms of detecting malicious Web servers, existing solutions fallinto two categories: 1) static feature-based detection; and 2) dynamicfeature-based detection. Static feature-based systems analyze thecontent of Web pages and extract features, such as Uniform ResourceLocator (URL) patterns, presence of certain dangerous tags or functions,or the presence of malicious JavaScript codes, which can be used todistinguish malicious Web pages from benign Web pages. Dynamicfeature-based systems, on the other hand, visit Websites with aninstrumented browser and monitor all the run-time traces for signs ofmalicious Web activities. Although those existing solutions may detectmalicious Web servers, cyber criminals are evolving and increasinglyadopting a variety of mechanisms, such as, for example, obfuscation,cloaking, and the like, to evade detection. For example, existingsolutions extract features from sever redirection behavior to detectmalicious Web infrastructures, including network traffic redirectionchain length, different referral fields, country similarity, et cetera.However, these extracted features may be easily manipulated by cybercriminals. For example, referral fields may be arbitrarily set by cybercriminals and the length of the network traffic redirection chain may bealtered by adding more compromised benign servers in the middle of thechain. In addition, these existing solutions also rely on clientfeatures, such as, for example, diversity of browsers used by clientsand diversity of countries where the clients are located. These existingsolutions require information collected from a large number of clientsand are less effective when applied to enterprise networks.

In contrast, illustrative embodiments may be deployed in both enterprisenetworks and Internet Service Provider (ISP) networks, and may detectmalicious web infrastructures even when only a few clients access themalicious Web infrastructures. Illustrative embodiments exploitpersistent features and properties of malicious Web infrastructures froma new perspective, which allows automatic detection of malicious Webinfrastructures without requiring any seed malicious Web servers.Illustrative embodiments detect such inherent features and properties ofmalicious Web infrastructures by leveraging the visibility of serverswithin a network and the topology of server network traffic redirectionchains. Additionally, illustrative embodiments utilize a server networktraffic propagation chain algorithm to identify more malicious Webservers and compromised benign Web servers.

Illustrative embodiments detect malicious web infrastructures based onthe server visibility to search engines and the topology of networktraffic redirection chains between visible servers and invisibleservers. While benign servers are usually visible and may be found bysearching using search engines, most malicious servers are invisible tosearch engines, either because cyber criminals may purposefully blocksearch engines to prevent being searchable or because search engines mayintentionally remove malicious servers from their index to protect endusers. More importantly, network traffic redirection behavior betweenvisible servers and invisible servers are significantly different fromnetwork traffic redirection behavior between malicious servers.Illustrative embodiments identify several distinct features of thevisible server to invisible server transitions within network trafficredirection chains to accurately detect malicious servers withinmalicious Web infrastructures and generate a server network trafficpropagation chain graph to identify more compromised benign servers andmalicious servers within the detected malicious Web infrastructures.

In addition, illustrative embodiments decrease the amount of networktraffic that needs to be analyzed to detect the malicious serversbecause illustrative embodiments only analyze network trafficredirection between visible servers and invisible servers within thenetwork, instead of analyzing the network traffic of the entireredirection chain. As a result, illustrative embodiments are moreefficient and suitable for large enterprise networks rather thanexisting solutions. Further, illustrative embodiments may detectmalicious Web infrastructures even when there are only a few clientsaccessing the malicious Web infrastructures, while existing solutionsrequire a large and diverse number of clients that are accessing themalicious Web infrastructures. Furthermore, illustrative embodiments mayproactively identify hidden malicious Web servers and compromised benignWeb servers before these servers are detected by existing solutions thatuse blacklists of Web servers, for example.

An illustrative embodiment may include three main components: 1) aserver visibility check component; 2) a malicious infrastructuredetection component; and 3) a malicious infrastructure serverpropagation chain detection component. The server visibility checkcomponent automatically checks Web server white lists to determinewhether a second level domain name of each Web server within a networkis located within one or more white lists. The white lists may include,for example, Alexa Top 1 million servers list and EasyList server listbecause these white lists contain most known and popular Web serverdomain names. If a Web server is located within a white list, the servervisibility check component identifies the Web server as a visibleserver. If a Web server is not found within any of the searched whitelists, then the server visibility check component will query a set ofsearch engines, such as, for example, Google, Bing, Yahoo!, and Baidu,for Web server domain names. The server visibility check component mayselect, for example, the top 50 domain names from the search results. Ifa Web server, which was not found within a white list, is found withinthe search result domain name list, the server visibility checkcomponent identifies the Web server as a visible server. If a Webserver, which was not found within a white list, also is not foundwithin the search result domain name list, the server visibility checkcomponent identifies the Web server as an invisible server.

The malicious infrastructure detection component determines all pairs ofWeb servers that are involved in network traffic redirection fromvisible servers to invisible servers and builds a bipartite graph ofvisible servers and invisible servers based on the determined networktraffic redirection information. First, based on the results of theserver visibility check, the malicious infrastructure detectioncomponent classifies all the identified servers within the network aseither a visible server or an invisible server. Then, the maliciousinfrastructure detection component determines the server vertices andedges within the bipartite graph that are involved in network trafficredirection chains from visible servers to invisible servers. For eachedge in the bipartite graph involved in a network traffic redirectionchain, the malicious infrastructure detection component extractsgraph-based features, such as, for example, out-degree of each invisibleserver, in-degree of each invisible server, and the ratio betweenout-degree and in-degree for each invisible server involved in a networktraffic redirection chain. An out-degree is a number of directed edgesgoing out of a particular server vertex. An in-degree is a number ofdirected edges coming into a particular server vertex.

In addition, for each edge in the bipartite graph involved in a networktraffic redirection chain, the malicious infrastructure detectioncomponent also extracts distance-based features, such as, for example, adistance between IP address numbers of each of the invisible servers, adifference in domain name registration information between each of theinvisible servers, and a distance in physical location between each ofthe invisible servers. Afterward, the malicious infrastructure detectioncomponent inputs the extracted graph-based features and extracteddistance-based features into a machine learning classifier, such as, forexample, a J48 decision tree algorithm, which is trained on knownmalicious Web infrastructures, to detect malicious edges between visibleserver vertices and invisible server vertices. The maliciousinfrastructure detection component uses the detected malicious edgesbetween visible server vertices and invisible server vertices toidentify malicious servers within a malicious Web infrastructure.

The malicious infrastructure server propagation chain detectioncomponent builds a network traffic propagation chain graph and thenpropagates malicious scores of servers onto the graph to identifyadditional malicious servers based on their correlations with identifiedmalicious servers, which were identified as malicious servers by themalicious infrastructure detection component. First, the maliciousinfrastructure server propagation chain detection component builds thenetwork traffic propagation chain graph for the invisible servers thatare accessed through redirection based on redirection relationships,such as, for example, HTTP redirection, Javascript redirection, andIframe redirection. For invisible servers that are accessed throughdirect client device visit, the malicious infrastructure serverpropagation chain detection component runs a clustering program to groupinvisible servers that share certain features, such as, for example,common or similar IP addresses, common or similar Whois information, orcommon or similar accessing client IP addresses. Whois is a query andresponse protocol that is used for querying databases storinginformation corresponding to registered users or assignees of Internetresources, such as, for example, domain names, IP address blocks, andother similar resources. Then, the malicious infrastructure serverpropagation chain detection component generates relationships betweenthose invisible servers within a same cluster and augments the networktraffic propagation chain graph by adding new edges representing the newrelationships. For example, if two invisible servers share similar IPaddresses, Whois information, or accessing client IP addresses, themalicious infrastructure server propagation chain detection componentwill add an edge between those two invisible servers.

After building the network traffic propagation chain graph, themalicious infrastructure server propagation chain detection componentassigns a malicious score (S_(mal)) and generates a visibility score(S_(vis)) for each server in the network traffic propagation chaingraph. For each server that was detected by the malicious infrastructuredetection component as being a malicious server, the maliciousinfrastructure server propagation chain detection component assigns amalicious score of one (S_(mal)=1). For all other servers, the maliciousinfrastructure server propagation chain detection component assigns amalicious score of zero (S_(mal)=0). The malicious infrastructure serverpropagation chain detection component generates the visibility score asthe number of connected visible servers over the number of connectedinvisible servers using the following equation:

$S_{Vis} = {{\min ( {1,\frac{{Num}_{vis}}{{Num}_{invis} + 1}} )}.}$

Then, the malicious infrastructure server propagation chain detectioncomponent annotates both the assigned malicious scores and generatedvisibility scores onto the corresponding server vertices of the networktraffic propagation chain graph. Afterward, the malicious infrastructureserver propagation chain detection component iteratively propagatesmalicious scores and visibility scores of server vertices to neighboringserver vertices and recalculates the malicious scores and visibilityscores of the neighboring server vertices. After several iterations ofscore propagation to neighboring server vertices, the graph will achievea stable state with new malicious and visibility scores of serververtices changing very little or not at all. For those invisible serverswhose new malicious score is greater than a predefined malicious scorethreshold value (α) and whose new visibility score is less than apredefined visibility score threshold value (β), the maliciousinfrastructure server propagation chain detection component identifiesthose invisible servers as malicious servers. For those visible serverswhose new malicious score is greater than the predefined malicious scorethreshold value (α) and whose new visibility score is less than thepredefined visibility score threshold value (β), the maliciousinfrastructure server propagation chain detection component identifiesthose visible servers as compromised servers.

With reference now to FIG. 3, a diagram of an example of components of amalicious Web infrastructure detection application is depicted inaccordance with an illustrative embodiment. Malicious Web infrastructuredetection application 300 may be, for example, malicious Webinfrastructure detection application 218 in FIG. 2. In this example,malicious Web infrastructure detection application 300 includes servervisibility check component 302, malicious infrastructure detectioncomponent 304, and malicious infrastructure server propagation chaindetection component 306. However, it should be noted that malicious Webinfrastructure detection application 300 may include more or fewercomponents than shown. For example, one or more components may becombined into one component. Also, one or more components of maliciousWeb infrastructure detection application 300 may be implemented in oneor more computers or data processing systems.

Server visibility check component 302 automatically determines whethereach identified server within a network is either a visible server or aninvisible server. A visible server is a network server that is directlyaccessed by a client device and is visible to the accessing clientdevice. An invisible server is a network server that is typicallyindirectly accessed by a client device via a visible server and is notvisible to the accessing client device. However, sometimes a clientdevice may access an invisible server directly.

In this example, server visibility check component 302 includes serverwhite list checker 308, set of search engines 310, list of visibleservers 312, and list of invisible servers 314. First, server visibilitycheck component 302 utilizes server white list checker 308 to determinewhether a server is listed on set of server domain name white lists 316.Set of server domain name white lists 316 may be stored in servervisibility check component 302 or may be stored on one or more remoteserver devices. Set of server domain name white lists 316 is a set ofone or more white lists that contain listings of domain names forservers that are determined to be benign or safe (i.e., not malicious).If server visibility check component 302 locates a server within set ofserver domain name white lists 316, then server visibility checkcomponent 302 identifies that server as a visible server and places thatserver within list of visible servers 312.

If server visibility check component 302 does not locate a particularserver within set of server domain name white lists 316, then servervisibility check component 302 utilizes set of search engines 310 toconduct a Web search for domain names of servers. Set of search engines310 is a set of one or more Web search engines that generate set ofserver domain name search results 318. Set of server domain name searchresults 318 is a set of one or more Web search results containing domainnames of servers that are determined to be benign or safe.

If server visibility check component 302 does not locate a particularserver within set of server domain name white lists 316, but does locatethat particular server within set of server domain name search results318, then server visibility check component 302 identifies thatparticular server as a visible server and places that particular serverwithin list of visible servers 312. If server visibility check component302 does not locate a particular server within set of server domain namewhite lists 316 and does not locate that particular server within set ofserver domain name search results 318, then server visibility checkcomponent 302 identifies that particular server as an invisible serverand places that particular server within list of invisible servers 314.

Malicious infrastructure detection component 304 identifies maliciousservers within one or more malicious Web infrastructures in a network.In this example, malicious infrastructure detection component 304includes bipartite graph 320 and machine learning classifier 322.Malicious infrastructure detection component 304 generates bipartitegraph 320 utilizing list of visible servers 312 and list of invisibleservers 314 generated by server visibility check component 302. Abipartite graph is a graph whose vertices can be divided into twodisjoint sets (i.e., a set of visible servers and a set of invisibleservers). An example of a bipartite graph is illustrated in FIG. 4.

After generating bipartite graph 320 of visible server vertices andinvisible server vertices, malicious infrastructure detection component304 determines directed edges from visible servers to invisible serversinvolved in network traffic redirection chains within bipartite graph320. For each edge involved in a network traffic redirection chain,malicious infrastructure detection component 304 extracts graph-basedfeatures, such as, for example, out-degree, in-degree, and ratio betweenout-degree and in-degree for each invisible server involved in a networktraffic redirection chain. In addition, for each edge involved in anetwork traffic redirection chain, malicious infrastructure detectioncomponent 304 also extracts distance-based features, such as, forexample, distance between IP address numbers, difference in domain nameregistration information, and distance in physical location for eachinvisible server involved in a network traffic redirection chain.

After extracting the graph-based and distance-based features of theinvisible servers involved in a network traffic redirection chain,malicious infrastructure detection component 304 inputs the extractedgraph-based and distance-based features (i.e., classifier input 324)into machine learning classifier 322. Machine learning classifier 322may be, for example, a decision tree algorithm trained on knownmalicious Web infrastructures. Machine learning classifier 322 detectsmalicious edges between visible server vertices and invisible serververtices involved in a network traffic redirection chain based onclassifier input 324. Utilizing the detected malicious edges betweenvisible server vertices and invisible server vertices involved in anetwork traffic redirection chain, malicious infrastructure detectioncomponent 304 is able to identify malicious servers.

Malicious infrastructure server propagation chain detection component306 identifies additional malicious servers based on their correlationsto servers previously identified as malicious by maliciousinfrastructure detection component 304. First, malicious infrastructureserver propagation chain detection component 306 generates servernetwork traffic propagation chain graph 326 using relationships ofinvisible servers accessed through redirection. For invisible serversthat are accessed through direct client device visit, maliciousinfrastructure server propagation chain detection component 306 runsclustering process 328 to group invisible servers that share common orsimilar features, such as, for example, IP addresses, Whois information,or client IP addresses. After running clustering process 328, maliciousinfrastructure server propagation chain detection component 306generates relationships between those invisible servers within a samecluster and augments server network traffic propagation chain graph 326by adding new edges representing the new relationships.

Further, malicious infrastructure server propagation chain detectioncomponent 306 assigns a malicious score and generates a visibility scorefor each server involved in a network traffic redirection chain. Foreach server that was previously identified by malicious infrastructuredetection component 304 as being malicious, malicious infrastructureserver propagation chain detection component 306 assigns a maliciousscore of one. For all other servers not previously identified asmalicious, malicious infrastructure server propagation chain detectioncomponent 306 assigns a malicious score of zero. The malicious score ofeach server may be stored in malicious scores 330. Maliciousinfrastructure server propagation chain detection component 306generates the visibility score as the number of connected visibleservers over the number of connected invisible servers for each serverinvolved in a network traffic redirection chain. The visibility score ofeach server maybe stored in visibility scores 332.

Afterward, malicious infrastructure server propagation chain detectioncomponent 306 adds the assigned malicious score and generated visibilityscore to each corresponding server vertex in server network trafficpropagation chain graph 326. Then, malicious infrastructure serverpropagation chain detection component 306 propagates malicious scoresand visibility scores of server vertices to neighboring server verticesand then recalculates the corresponding malicious and visibility scoresof the neighboring server vertices. Subsequent to iterativelypropagating malicious and visibility scores to neighboring serververtices, malicious infrastructure server propagation chain detectioncomponent 306 identifies invisible servers having a new malicious scoregreater than malicious score threshold value 334 and having a newvisibility score less than visibility score threshold value 336 asmalicious and adds those invisible servers to malicious server list 338.Malicious infrastructure server propagation chain detection component306 identifies visible servers having a new malicious score greater thanmalicious score threshold value 334 and having a new visibility scoreless than visibility score threshold value 336 as compromised and addsthose visible servers to compromised server list 340.

With reference now to FIG. 4, a diagram of an example of a bipartitegraph is depicted in accordance with an illustrative embodiment.Bipartite graph 400 may be, for example, bipartite graph 316 in FIG. 3.Bipartite graph 400 places each server of a plurality of servers withina network in one of two different sets of servers. One set of servers isvisible servers 402 and the other set of servers is invisible servers404.

In this example, visible server 1 406 and visible server 2 408 areinvolved in server network traffic redirection chains. For example,visible server 1 406 redirects network traffic to invisible server 3410, which redirects the network traffic to invisible server 4 412,which in turn redirects the network traffic to invisible server 5 414.Similarly, visible server 2 408 redirects network traffic to invisibleserver 3 410, which redirects the network traffic to invisible server 4412, which in turn redirects the network traffic to invisible server 5414. In addition, visible server 2 408 redirects other network trafficto invisible server 6 416. A malicious infrastructure detectioncomponent, such as malicious infrastructure detection component 304 inFIG. 3, analyzes the relationships between visible servers and theinvisible servers involved in the network traffic redirection chains byextracting graph-based features and distance-based features for eachinvisible server involved in a particular network traffic redirectionchain. In this example, graph-based features for invisible server 3 410are out-degree of 1, in-degree of 2, and a ratio between out-degree andin-degree of 0.5

With reference now to FIG. 5, a specific example of machine learningclassifier input is depicted in accordance with an illustrativeembodiment. Machine learning classifier input 500 may be, for example,classifier input 320 in FIG. 3. Machine learning classifier input 500 isinput into a machine learning classifier, such as, for example, machinelearning classifier 322 in FIG. 3. In this example, machine learningclassifier input 500 includes format 502 and example 504.

Format 502 represents an example format for machine learning classifierinput 500. In this example, the format is relation, out-degree,in-degree, ratio between out-degree and in-degree, IP distance,registration information distance, and physical location distance.However, it should be noted that illustrative embodiments may utilizeother formats as well.

Using format 502 and an example from FIG. 4, example 504 includes arelation of “visible_server_1→invisible_server_3”, an out-degree of “1”,an in-degree of “2”, a ratio between out-degree and in-degree of “0.5”,an IP distance of “false”, a registration information distance of“false”, and a physical location distance of “false”. In this example,false means not related and true means related. For example, the IPaddress distance between visible server 1 and invisible server 3 is toofar apart to be considered related.

With reference now to FIG. 6, a diagram of an example of a propagationgraph generation process is depicted in accordance with an illustrativeembodiment. Propagation graph generation process 600 is a process forgenerating a server network traffic propagation chain graph, such as,for example, server network traffic propagation chain graph 322 in FIG.3. In this example, propagation graph generation process 600 includesgenerating graph of servers from network trace 602, generating servernetwork traffic graph based on redirection 604, and finally generatingserver network traffic propagation chain graph 606.

Graph of servers from network trace 602 is a bipartite graph of visibleservers and invisible servers, such as bipartite graph 400 in FIG. 4,generated by a server visibility check component, such as servervisibility check component 302 in FIG. 3. Server network traffic graphbased on redirection 604 is a graph showing edges between servers basedon access through server redirection 608. Server network trafficpropagation chain graph 606 is a graph showing edges based on accessthrough direct client visit 610.

With reference now to FIG. 7, a flowchart illustrating a process foridentifying servers within a network as either a visible server or aninvisible server is shown in accordance with an illustrative embodiment.The process shown in FIG. 7 may be implemented in a computer, such asdata processing system 200 in FIG. 2.

The process begins when the computer automatically searches a set ofserver domain name white lists to determine whether a server in aplurality of identified servers within a network is listed in the set ofserver domain name white lists (step 702). The computer may use a serverwhite list checker component, such as server white list checker 308 inFIG. 3, to search the set of server domain name white lists, such as setof server domain name white lists 318 in FIG. 3. In addition, thecomputer queries a set of search engines to determine whether the serverin the plurality of identified servers within the network is listed in aserver domain name search result (step 704). The set of search enginesmay be, for example, set of search engines 310 in FIG. 3. The serverdomain name search result may be, for example, set of server domain namesearch results 318 in FIG. 3.

Afterward, the computer makes a determination as to whether the serverin the plurality of identified servers within the network is listed inthe set of server domain name white lists (step 706). If the computerdetermines that the server in the plurality of identified servers withinthe network is not listed in the set of server domain name white lists,no output of step 706, then the computer makes a determination as towhether the server in the plurality of identified servers within thenetwork is listed in the server domain name search result (step 708). Ifthe computer determines that the server in the plurality of identifiedservers within the network is not listed in the server domain namesearch result, no output of step 708, then the computer identifies theserver in the plurality of identified servers not listed in the set ofserver domain name white lists and not listed in the server domain namesearch result as an invisible server (step 710). The computer adds theserver not listed in the set of server domain name white lists and notlisted in the server domain name search result to an invisible serverlist, such as list of invisible servers 314 in FIG. 3 (step 712).Thereafter, the process terminates.

Returning again to step 706, if the computer determines that the serverin the plurality of identified servers within the network is listed inthe set of server domain name white lists, yes output of step 706, thenthe computer identifies the server in the plurality of identifiedservers listed in at least one of the set of server domain name whitelists and the server domain name search result as a visible server (step714). The computer then adds the server listed in at least one of theset of server domain name white lists and the server domain name searchresult to a visible server list, such as list of visible servers 312 inFIG. 3 (step 716). Thereafter, the process terminates.

Returning again to step 708, if the computer determines that the serverin the plurality of identified servers within the network is listed inthe server domain name search result, yes output of step 708, then theprocess proceeds to step 714 where the computer identifies the server asa visible server and adds the server to the visible server list at step716 with the process terminating thereafter.

With reference now to FIGS. 8A and 8B, a flowchart illustrating aprocess for identifying malicious servers within a network is shown inaccordance with an illustrative embodiment. The process shown in FIGS.8A and 8B may be implemented in a computer, such as data processingsystem 200 in FIG. 2.

The process begins when the computer generates a bipartite graph ofvisible servers and invisible servers in a plurality of identifiedservers within a network (step 802). The bipartite graph may be, forexample, bipartite graph 400 in FIG. 4. The computer places each serverin the plurality of identified servers within the network in thebipartite graph of visible servers and invisible servers based onlocating each server in one of a visible server list or an invisibleserver list (step 804). The computer also analyzes network trafficredirection chains from visible servers to invisible servers within thenetwork in the bipartite graph (step 806).

Afterward, by the computer identifies a set of server verticescorresponding to the visible servers and invisible servers in thebipartite graph involved in the network traffic redirection chains fromthe visible servers to the invisible servers based on the analysis (step808). Then, for each edge between the server vertices corresponding tothe visible servers and invisible servers in the bipartite graphinvolved in the network traffic redirection chains, the computerdetermines graph-based features within the bipartite graph correspondingto each of the invisible server vertices involved in the network trafficredirection chains and distance-based features corresponding to each ofthe invisible server vertices involved in the network trafficredirection chains (step 810).

Subsequently, the computer inputs the determined graph-based featureswithin the bipartite graph corresponding to each of the invisible serververtices involved in the network traffic redirection chains and thedetermined distance-based features corresponding to each of theinvisible server vertices involved in the network traffic redirectionchains into a machine learning classifier (step 812). The machinelearning classifier may be, for example, machine learning classifier 322in FIG. 3. The computer, using the machine learning classifier,determines malicious edges between the server vertices corresponding tothe visible servers and invisible servers involved in the networktraffic redirection chains based on the determined graph-based featureswithin the bipartite graph corresponding to each of the invisible serververtices involved in the network traffic redirection chains and thedetermined distance-based features corresponding to each of theinvisible server vertices involved in the network traffic redirectionchains input into the machine learning classifier (step 814).

The computer then identifies malicious server vertices in the bipartitegraph corresponding to invisible servers involved in the network trafficredirection chains based on the determined malicious edges between theserver vertices corresponding to the visible servers and invisibleservers involved in the network traffic redirection chains (step 816).Further, the computer blocks access to malicious servers correspondingto the identified malicious server vertices in the bipartite graph (step818). The computer also sends an alert to network security regardingblocking the access to the malicious servers for possible further action(step 820). Thereafter, the process terminates.

With reference now to FIG. 9, a flowchart illustrating a process forpropagating malicious and visibility scores of identified maliciousservers to neighboring invisible servers to identify additionalmalicious servers based on their correlation to the identified maliciousservers is shown in accordance with an illustrative embodiment. Theprocess shown in FIG. 9 may be implemented in a computer, such as dataprocessing system 200 in FIG. 2.

The process begins when the computer generates a propagation graph thatincludes each invisible server accessed via network traffic redirectionbased on all network traffic redirection relationships between invisibleservers (step 902). In addition, the computer clusters those invisibleservers accessed via direct client visit into different groups based onshared common features between those invisible servers accessed viadirect client visit (step 904). Further, the computer generates arelationship between those invisible servers accessed via direct clientvisit within a same group (step 906).

Afterward, the computer adds an edge between those invisible serverswith the generated relationship within the same group (step 908). Thecomputer also assigns a malicious score to those invisible servers thathave been previously identified as a malicious server by a machinelearning classifier, such as machine learning classifier 322 in FIG. 3(step 910). Further, the computer generates a visibility score for thoseinvisible servers that have been previously identified as a maliciousserver by the machine learning classifier (step 912).

Subsequently, the computer adds the assigned malicious score and thegenerated visibility score to corresponding server vertices within thepropagation graph (step 914). In addition, the computer propagates theassigned malicious score and the generated visibility score of acorresponding server vertex to neighboring server vertices within thepropagation graph (step 916). Then, the computer generates a newmalicious score and a new visibility score for each of the neighboringserver vertices within the propagation graph based on propagatingmalicious and visibility scores (step 918). Afterward, the computeridentifies each server corresponding to a server vertex within thepropagation graph having the generated new malicious score greater thana predefined malicious score threshold value and having the generatednew visibility score less than a predefined visibility score thresholdvalue as a malicious server (step 920). Thereafter, the processterminates.

Thus, illustrative embodiments provide a computer-implemented method,computer system, and computer program product for identifying maliciousservers within malicious Web infrastructures based on visibility ofnetwork servers and topology of network traffic redirection chains ofthe network servers. The descriptions of the various embodiments of thepresent invention have been presented for purposes of illustration, butare not intended to be exhaustive or limited to the embodimentsdisclosed. Many modifications and variations will be apparent to thoseof ordinary skill in the art without departing from the scope and spiritof the described embodiment. The terminology used herein was chosen tobest explain the principles of the embodiment, the practical applicationor technical improvement over technologies found in the marketplace, orto enable others of ordinary skill in the art to understand theembodiments disclosed here.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

1-10. (canceled)
 11. A computer system for identifying maliciousservers, the computer system comprising: a bus system; a storage deviceconnected to the bus system, wherein the storage device stores programinstructions; and a processor connected to the bus system, wherein theprocessor executes the program instructions to: determine maliciousedges between server vertices corresponding to visible servers andinvisible servers involved in network traffic redirection chains basedon determined graph-based features within a bipartite graphcorresponding to visible and invisible server vertices involved in thenetwork traffic redirection chains and determined distance-basedfeatures corresponding to the invisible server vertices involved in thenetwork traffic redirection chains; identify malicious server verticesin the bipartite graph based on the determined malicious edges betweenthe server vertices corresponding to the visible servers and invisibleservers involved in the network traffic redirection chains; and blockaccess by client devices to malicious servers corresponding to theidentified malicious server vertices in the bipartite graph.
 12. Acomputer program product for identifying malicious servers, the computerprogram product comprising a computer readable storage medium havingprogram instructions embodied therewith, the program instructionsexecutable by a computer to cause the computer to perform a methodcomprising: determining, by the computer, malicious edges between serververtices corresponding to visible servers and invisible servers involvedin network traffic redirection chains based on determined graph-basedfeatures within a bipartite graph corresponding to visible and invisibleserver vertices involved in the network traffic redirection chains anddetermined distance-based features corresponding to the invisible serververtices involved in the network traffic redirection chains;identifying, by the computer, malicious server vertices in the bipartitegraph based on the determined malicious edges between the serververtices corresponding to the visible servers and invisible serversinvolved in the network traffic redirection chains; and blocking, by thecomputer, access by client devices to malicious servers corresponding tothe identified malicious server vertices in the bipartite graph.
 13. Thecomputer program product of claim 12 further comprising: placing, by thecomputer, each server in a plurality of identified servers within anetwork in the bipartite graph based on locating each server in one of avisible server list or an invisible server list.
 14. The computerprogram product of claim 13, wherein the placing, by the computer, eachserver in the plurality of identified servers within the network in thebipartite graph further comprises: searching, by the computer, a set ofserver domain name white lists to determine whether a server in theplurality of identified servers within the network is listed in a set ofserver domain name white lists; querying, by the computer, a set ofsearch engines to determine whether the server in the plurality ofidentified servers within the network is listed in a server domain namesearch result; responsive to the computer determining that the server inthe plurality of identified servers within the network is not listed inthe set of server domain name white lists and not listed in the serverdomain name search result, identifying, by the computer, the server asan invisible server and adding, by the computer, the server to theinvisible server list; and responsive to the computer determining thatthe server in the plurality of identified servers within the network islisted in at least one of the set of server domain name white lists andthe server domain name search result, identifying, by the computer, theserver in the plurality of identified servers as a visible server andadding, by the computer, the server to the visible server list.
 15. Thecomputer program product of claim 12 further comprising: inputting, bythe computer, the determined graph-based features within the bipartitegraph corresponding to the invisible server vertices involved in thenetwork traffic redirection chains and the determined distance-basedfeatures corresponding to the invisible server vertices involved in thenetwork traffic redirection chains into a machine learning classifier.16. The computer program product of claim 15, wherein the determinedgraph-based features are out-degree, in-degree, and a ratio betweenout-degree and in-degree for each invisible server involved in a networktraffic redirection chain.
 17. The computer program product of claim 15,wherein the determined distance-based features are distance between IPaddress numbers of each of the invisible servers, difference in domainname registration information between each of the invisible servers, anddistance in physical location between each of the invisible servers. 18.The computer program product of claim 12 further comprising: assigning,by the computer, a malicious score to those invisible servers identifiedas malicious.
 19. The computer program product of claim 18 furthercomprising: generating, by the computer, a visibility score for thoseinvisible servers identified as malicious.
 20. The computer programproduct of claim 19 further comprising: adding, by the computer, theassigned malicious score and the generated visibility score tocorresponding server vertices within a server network trafficpropagation chain graph; and propagating, by the computer, the assignedmalicious score and the generated visibility score of a correspondingserver vertex to neighboring server vertices within the server networktraffic propagation chain graph.